A Smoothed Algorithm with Convergence Analysis under Generalized Maximum Correntropy Criteria in Impulsive Interference
نویسندگان
چکیده
منابع مشابه
Sparsity-Aware Recursive Maximum Correntropy Criteria Adaptive Filtering Algorithm
To address sparse channel estimation problem in nonGaussian impulsive noise environment, a recursive maximum correntropy criteria (RMCC) algorithm using sparse constraint is proposed to combat impulsive-inducing instability. Specifically, the recursive algorithm on the correntrioy with a forgetting factor of error at iteration is to solve steady-state error for improving the maximum correntropy...
متن کاملConvex regularized recursive maximum correntropy algorithm
In this brief, a robust and sparse recursive adaptive filtering algorithm, called convex regularized recursive maximum correntropy (CR-RMC), is derived by adding a general convex regularization penalty term to the maximum correntropy criterion (MCC). An approximate expression for automatically selecting the regularization parameter is also introduced. Simulation results show that the CR-RMC can...
متن کاملProportionate Adaptive Filtering under Correntropy Criterion in Impulsive Noise Environments
An improved proportionate adaptive filter based on the Maximum Correntropy Criterion (IP-MCC) is proposed for identifying the system with variable sparsity in an impulsive noise environment. Utilization of MCC mitigates the effect of impulse noise while the improved proportionate concepts exploit the underlying system sparsity to improve the convergence rate. Performance analysis of the propose...
متن کاملError analysis for the semi-supervised algorithm under maximum correntropy criterion
As a similarity measure, correntropy has been increasingly employed in machine learning research. While numerous experimental results have shown the effectiveness of correntropy based methods, the theoretical analysis in this area is still poorly understood. In this paper, we propose a novel semi-supervised algorithm under the maximum correntropy criterion, and present an elaborate error analys...
متن کاملRecursive Generalized Maximum Correntropy Criterion Algorithm with Sparse Penalty Constraints for System Identification
To address sparse system identification problem in non-Gaussian impulsive noise environment, the recursive generalized maximum correntropy criterion (RGMCC) algorithm with sparse penalty constraints is proposed to combat impulsive-inducing instability. Specifically, a recursive algorithm based on the generalized correntropy with a forgetting factor of error is developed to improve the performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21111099